Spectral analysis of matrix polynomials— I. canonical forms and divisors
نویسندگان
چکیده
منابع مشابه
Some New Canonical Forms for Polynomials
We give some new canonical representations for forms over C. For example, a general binary quartic form can be written as the square of a quadratic form plus the fourth power of a linear form. A general cubic form in (x1, . . . , xn) can be written uniquely as a sum of the cubes of linear forms `ij(xi, . . . , xj), 1 ≤ i ≤ j ≤ n. A general ternary quartic form is the sum of the square of a quad...
متن کاملEla a Newton Method for Canonical Wiener-hopf and Spectral Factorization of Matrix Polynomials
The paper presents a novel Newton method for constructing canonical Wiener-Hopf factorizations of complex matrix polynomials and spectral factorizations of positive definite matrix polynomials. The factorizations are the ones needed for discrete-time linear systems and hence with respect to the unit circle. The Jacobi matrix is analyzed, and the convergence of the method is proved and tested nu...
متن کاملA Newton method for canonical Wiener-Hopf and spectral factorization of matrix polynomials
The paper presents a novel Newton method for constructing canonical Wiener-Hopf factorizations of complex matrix polynomials and spectral factorizations of positive definite matrix polynomials. The factorizations are the ones needed for discrete-time linear systems and hence with respect to the unit circle. The Jacobi matrix is analyzed, and the convergence of the method is proved and tested nu...
متن کاملSmith Forms of Palindromic Matrix Polynomials
Many applications give rise to matrix polynomials whose coefficients have a kind of reversal symmetry, a structure we call palindromic. Several properties of scalar palindromic polynomials are derived, and together with properties of compound matrices, used to establish the Smith form of regular and singular T -palindromic matrix polynomials over arbitrary fields. The invariant polynomials are ...
متن کاملNearly Optimal Algorithms for Canonical Matrix Forms
A Las Vegas type probabilistic algorithm is presented for nding the Frobenius canonical form of an n n matrix T over any eld K. The algorithm requires O~(MM(n)) = MM(n) (logn) O(1) operations in K, where O(MM(n)) operations in K are suucient to multiply two n n matrices over K. This nearly matches the lower bound of (MM(n)) operations in K for this problem, and improves on the O(n 4) operations...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 1978
ISSN: 0024-3795
DOI: 10.1016/0024-3795(78)90026-5